Circular mixed hypergraphs II:The upper chromatic number
نویسندگان
چکیده
منابع مشابه
Circular mixed hypergraphs II: The upper chromatic number
A mixed hypergraph is a triple H = (X, C,D), where X is the vertex set and each of C, D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is a mapping c : X → [k] such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. A mixed hypergraph H is called circular if there exists a host cycle on the v...
متن کاملCircular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic properties. We study the relationship between circular chromatic number with chromatic number and fractional chromatic number of uniform hypergraphs.
متن کاملOn the Upper Chromatic Number of Uniform Hypergraphs
In this paper we determine some necessary conditions for a uniform hypergraph to have a given upper chromatic number. Mathenmatics Subject Classification: 05C05
متن کاملApproximability of the upper chromatic number of hypergraphs
A C-coloring of a hypergraph H = (X, E) is a vertex coloring φ : X → N such that each edge E ∈ E has at least two vertices with a common color. The related parameter χ(H), called the upper chromatic number of H, is the maximum number of colors can be used in a C-coloring of H. A hypertree is a hypergraph which has a host tree T such that each edge E ∈ E induces a connected subgraph in T . Notat...
متن کاملCircular Chromatic Ramsey Number
Let χc(H) denote the circular chromatic number of a graph H. For graphs F and G, the circular chromatic Ramsey number Rχc(F,G) is the infimum of χc(H) over graphs H such that every red/blue edge-coloring of H contains a red copy of F or a blue copy of G. We characterize Rχc(F,G) in terms of a Ramsey problem for the families of homomorphic images of F and G. Letting zk = 3 − 2 −k, we prove that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.10.012